A Design and Prototyping of In-Network Processing Platform to Enable Adaptive Network Services

The explosive growth of the usage along with a greater diversification of communication technologies and applications imposes the Internet to manage further scalability and diversity, requiring more adaptive and flexible sharing schemes of network resources. Especially when a number of large-scale distributed applications concurrently share the resource, efficacy of comprehensive usage of network, computation, and storage resources is needed from the viewpoint of information processing performance. Therefore, a reconsideration of the coordination and partitioning of functions between networks (providers) and applications (users) has become a recent research topic. In this paper, we first address the need and discuss the feasibility of adaptive network services by introducing special processing nodes inside the network. Then, a design and an implementation of an advanced relay node platform are presented, by which we can easily prototype and test a variety of advanced in-network processing on Linux and off-the-shelf PCs. A key feature of the proposed platform is that integration between kernel and userland spaces enables to easily and quickly develop various advanced relay processing. Finally, on the top of the advanced relay node platform, we implement and test an adaptive packet compression scheme that we previously proposed. The experimental results show the feasibility of both the developed platform and the proposed adaptive packet compression

Path-Selection Method Based on the Available Bandwidth of Interfaces

The number of end devices equipped with multiple interfaces is increasing, owing to the spread of the Internet and the development of wireless communication technologies. Many applications work and communicate simultaneously in one end device. However, such end devices are difficult to utilize multiple interfaces and multiple paths effectively. Traditional transport protocols, such as Transmission Control Protocol (TCP) and User Datagram Protocol (UDP), support only single-path communication, so end device applications tend to use only single interface and path. Application’ flows become unbalanced and compete; hence, their performance degrades. There are many related works using multiple interfaces and paths simultaneously, such as Multipath Transmission Control Protocol (MPTCP) and Multipath Internet Protocol (MPIP). However, in some cases, these methods cannot improve the communication performance because scheduling to multipath for concurrent applications is not effective. In this paper, we propose the path-selection method for each application based on the available bandwidth of interfaces of a device. This method can utilize network resources and improve the performance of all applications when many applications work and communicate on a device equipped with multiple interfaces. We evaluate this method using network simulations and show its usability.5th Annual Conference on Computational Science & Computational Intelligence (CSCI\u2718), December 13-15, 2018, Las Vegas, Nevada, US

Experimental Performance Evaluation of the Collisions in LoRa Communications

With the development and spread of Internet of Things (IoT) technologies, various organizations in industry, academia, and government have begun collecting numerous types of data using sensor devices, which they then use to predict trends and identify potential problems with the services they provide. In the IoT, low power wide area (LPWA) networks can achieve low power consumption and provide a wide range of communication options that ensure constant service provision to deployed sensors. In particular, LoRa digital wireless communication technology, which has an open specification, uses an unlicensed band, and is inexpensive to install, is becoming increasingly popular and the number of sensors equipped with it is expected to grow in the future. However, since LoRa has insufficient specifications and verifications to resist channel contention within a heavily used frequency band, the performance of that technology is unclear when the number of sensors using the same frequency band increases. In this paper, we clarify the experimental performance of LoRa when multiple wireless communication nodes compete in different patterns.5th Annual Conference on Computational Science & Computational Intelligence (CSCI\u2718), December 13-15, 2018, Las Vegas, Nevada, US

Autonomous Data Transmission Control Based on Node Density for Multiple Spatio-temporal Data Retention

Although countless services can now be accessed via the Internet, some specific services such as local traffic conditions and limited-time sale advertisements are strongly dependent on geographical locations and times. Information of this type, which is commonly referred to as spatio-temporal data (STD), is not readily available online. Since the paradigm of local production and consumption of STDs can be effective for location-dependent applications, we previously proposed an STD data retention system that uses vehicular networks to create a mobile cloud. Unfortunately, effective data retention is difficult when multiple STDs exist in the same area because channel interference will result from the increased number of data transmissions. To resolve this issue, we herein propose an autonomous data transmission control method based on node density for multiple STD retention that facilitates a highly reliable coverage rate while limiting the individual data transmissions for each STD. Then, through simulations, we show that our proposed method is effective for simultaneously retaining multiple STDs.7th IEEE International Conference on Cloud Networking (CloudNet 2018), 22-24 October, 2018, Tokyo, Japa

Adaptive Server and Path Switching for Content Delivery Networks

The communications quality of content delivery networks (CDNs), which are geographically distributed networks that have been optimized for content delivery, deteriorates when interflow congestion conditions are severe. Herein, we propose an adaptive server and path switching scheme that is based on the estimated acquisition throughput of each path. We also provide simulation results that show our proposed method can provide higher throughput performance levels than existing methods

TCP Using Adaptive FEC to Improve Throughput Performance in High-Latency Environments

Packet losses significantly degrade TCP performance in high-latency environments. This is because TCP needs at least one round-trip time (RTT) to recover lost packets. The recovery time will grow longer, especially in high-latency environments. TCP keeps transmission rate low while lost packets are recovered, thereby degrading throughput. To prevent this performance degradation, the number of retransmissions must be kept as low as possible. Therefore, we propose a scheme to apply a technology called “forward error correction” (FEC) to the entire TCP operation in order to improve throughput. Since simply applying FEC might not work effectively, three function, namely, controlling redundancy level and transmission rate, suppressing the return of duplicate ACKs, interleaving redundant packets, were devised. The effectiveness of the proposed scheme was demonstrated by simulation evaluations in high-latency environments

Clustering Malicious DNS Queries for Blacklist-Based Detection

Some of the most serious threats to network security involve malware. One common way to detect malware-infected machines in a network is by monitoring communications based on blacklists. However, such detection is problematic because (1) no blacklist is completely reliable, and (2) blacklists do not provide the sufficient evidence to allow administrators to determine the validity and accuracy of the detection results. In this paper, we propose a malicious DNS query clustering approach for blacklist-based detection. Unlike conventional classification, our cause-based classification can efficiently analyze malware communications, allowing infected machines in the network to be addressed swiftly